Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
331	The categorical equivalence between complete (semi)lattices with operators and contexts with relations Peter Jipsen Add to Reading List Source URL: math.chapman.edu Language: English - Date: 2012-06-15 00:09:09 Boolean algebra Algebraic logic Algebraic structures Lattice theory Heyting algebra Kripke semantics Residuated lattice Distributive lattice Relation algebra Logic Mathematical logic Mathematics
332	Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal\|gsat\|neeldhara}@csa.iisc.ernet.in Add to Reading List Source URL: drona.csa.iisc.ernet.in Language: English - Date: 2014-08-01 08:33:48 NP-complete problems Vertex cover Vertex Graph Hamiltonian path Tree Clique Neighbourhood Connectivity Graph theory Mathematics Theoretical computer science
333	Asset Trading Volume in Infinite-Horizon Economies with Dynamically Complete Markets and Heterogeneous Agents: Comment∗ Peter Bossaerts† California Institute of Technology Add to Reading List Source URL: www.econ.ucla.edu Language: English - Date: 2006-01-16 17:34:26 General equilibrium theory Capital asset pricing model Entailment Logic Financial economics Forward contract
334	CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:44:41 Operations research Computational complexity theory NP-complete problems Job shop scheduling Mathematical optimization Approximation algorithm Linear programming Algorithm Vertex cover Theoretical computer science Applied mathematics Mathematics
335	KaHIP v0.71 – Karlsruhe High Quality Partitioning User Guide Peter Sanders and Christian Schulz Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany Email: {sanders, christian.schulz}@kit.edu Add to Reading List Source URL: algo2.iti.kit.edu Language: English - Date: 2015-01-03 02:07:55 Graph Graph coloring Planar separator theorem Path decomposition Graph theory NP-complete problems Graph partition
336	Kannan and Wheeler Algorithms for Molecular Biology 2012, 7:9 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Phylogenetics NP-complete problems Graph Maximum parsimony Routing algorithms Tree Phylogenetic network Steiner tree problem Directed acyclic graph Graph theory Mathematics Theoretical computer science
337	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-10-28 12:34:47 Spanning tree Loop-erased random walk Minimum spanning tree Chernoff bound Eulerian path NP-complete problems Dominating set Tutte polynomial Graph theory Mathematics Theoretical computer science
338	Theory of Wood Firing 6. Theory of Wood Firing Efficient and complete combustion is a prerequisite of utilising wood as an environmentally desirable fuel. In addition to a high rate of energy utilisation, the combustion Add to Reading List Source URL: www.videncenter.dk Language: English - Date: 2004-03-25 06:59:17 Chemical engineering Fuels Combustion Fuel gas Energy conversion Gasification Heat of combustion Wood-burning stove Pyrolysis Chemistry Energy Technology
339	Tree-based Coarsening and Partitioning of Complex Networks Roland Glantz, Henning Meyerhenke, and Christian Schulz arXiv:1402.2782v2 [cs.DS] 13 Feb 2014 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-02-13 20:08:15 Graph connectivity Combinatorial optimization Spanning tree NP-complete problems Graph partition Vertex Minimum spanning tree Edge contraction Tree Graph theory Mathematics Theoretical computer science
340	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:07 NP-complete problems Clique problem Vertex cover Matching Eulerian path Clique Minimum spanning tree Randomized algorithm Connectivity Graph theory Theoretical computer science Mathematics

UPDATE